Experimenting with Contests for Experimentation
نویسندگان
چکیده
منابع مشابه
Supplementary Appendix for Contests for Experimentation
This section provides details for Section 4.4 of the paper. We consider the class of contests with intermittently-public information disclosure: the principal specifies a set of times at which the entire history of successes to date is publicly disclosed; at other times, there is no information disclosed. Formally, an intermittently-public disclosure policy is a sequence (Mt, μt)t∈[0,T ] where,...
متن کاملImitation and Experimentation in Changing Contests
This paper analyzes the equilibrium play of individuals that are randomly matched to play a contest where the dominant action changes over time. Under myopic decision making, players adopt imitation strategies similar to those observed in evolutionary models with sampling from past play in the population. If the players are patient, equilibrium strategies display elements of experimentation in ...
متن کاملContests with Size Effects Contests with Size Effects
In this paper we analyze the structure of contest equilibria with a variable number of agents. First we analyze a situation where the total prize depends on the number of agents and where every single agent faces opportunity costs of investing in the contest. Second we analyze a situation where the agents face a trade-off between productive and appropriative investments. Here, the number of age...
متن کاملExperimenting with eXtreme Design
Ontology Design Patterns (ODPs) support reusability and use of best practices in ontology engineering. Previous studies have shown that Content ODPs, in particular, have some measurable beneficial effects on the produced ontologies. However, another conclusion was that methodology and tool support was needed. Now such support exist, in the form of the XD methodology and the XD Tools. In this pa...
متن کاملeskimo: EXPERIMENTING WITH SKELETONS
We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages for this class of problems. We present the eskimo library which represents an attempt to merge the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Southern Economic Journal
سال: 2017
ISSN: 0038-4038
DOI: 10.1002/soej.12185